Modeling Concurrent systems specified in a Temporal Concurrent Constraint language-I
نویسندگان
چکیده
منابع مشابه
Modeling concurrent systems specified in a temporal concurrent constraint language-I
In this paper we present an approach to model concurrent systems specified in a temporal concurrent constraint language. Our goal is to construct a framework in which it is possible to apply the Model Checking technique to programs specified in such language. This work is the first step to the framework construction. We present a formalism to transform a specification into a tcc Structure. This...
متن کاملModeling Concurrent systems speci ed in a Temporal Concurrent Constraint
In this paper we present an approach to model concurrent systems speciied in a temporal concurrent constraint language. Our goal is to construct a framework in which it is possible to apply the Model Checking technique to programs speciied in such language. This work is the rst step to the framework construction. We present a formalism to transform a speciication into a tcc Structure. This stru...
متن کاملTemporal Concurrent Constraint Programming
The temporal ccp model tcc [3] is aimed at specifying timed systems. Time is conceptually divided into discrete intervals. In a particular time interval, a ccp process receives a stimulus (i.e. a constraint) from the environment, it executes with this stimulus as the initial store, and when it reaches its resting point, it responds to the environment with the resulting store. Also the resting p...
متن کاملA Timed Concurrent Constraint Language
We study a timed concurrent constraint language, called tccp, which is obtained by a natural timed interpretation of the usual ccp constructs: action-prefixing is interpreted as the next-time operator and the parallel execution of agents follows the scheduling policy of maximal parallelism. Additionally, tccp includes a simple primitive which allows one to specify timing constraints. We define ...
متن کاملEmbedding Propagators in a Concurrent Constraint Language
Solving large and hard discrete combinatorial problems often requires the design of new constraints. Current constraint systems focus on either highlevel modeling or efficient implementation technology. While each approach lacks the advantages of the other one, this paper describes the combination of them in the high-level concurrent constraint language Oz. We describe an interface to Oz provid...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Theoretical Computer Science
سال: 2001
ISSN: 1571-0661
DOI: 10.1016/s1571-0661(04)00157-4